Informalogical Space: Decomposition, Compactness and Isomorphism

نویسنده

  • Jianwei Dian
چکیده

In a previous paper, we presented a meaning based information theory in which the core concept is an informalogical space. We introduced the concepts of an information net in an informalogical space, a piece of limit information of an information net, a separated informalogical space and a first countable informalogical space. We built a convergence theory of information nets and applied the convergence theory to information sequences. In this paper, we will introduce the concepts of decompositions of information and informalogical spaces, and we will prove some theorems about decompositions. We will introduce the concept of a compact informalogical space and prove that an informalogical space is compact if and only if each information net in the informalogical space has a subnet that converges. We will introduce the concept of an isomorphism between two informalogical spaces and the concept of an isomorphic invariant which is a property of informalogical spaces that is preserved under isomorphisms. We will prove that separatedness, limit uniqueness, first countability, and compactness are all isomorphic invariants.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A meaning based information theory - informalogical space: Basic concepts and convergence of information sequences

This paper presents an information theory that is based on meanings and relationships of information. This paper first introduces the very basic concept in our approach, a binary relation contain between two pieces of information, which is based on inference between the two pieces of information. Then, based on the contain relation, this paper introduces two basic operations union and intersect...

متن کامل

Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs

The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted space algorithms for these problems proving the following results: • Isomorphism for bounded tree distance width graphs is in L and thus complete for the class. We also show that for this kind of graphs a canon can be com...

متن کامل

On isomorphism of two bases in Morrey-Lebesgue type spaces

Double system of exponents with complex-valued coefficients is considered. Under some conditions on the coefficients, we prove that if this system forms a basis for the Morrey-Lebesgue type space on $left[-pi , pi right]$, then it is isomorphic to the classical system of exponents in this space.

متن کامل

ON COMPACTNESS AND G-COMPLETENESS IN FUZZY METRIC SPACES

In [Fuzzy Sets and Systems 27 (1988) 385-389], M. Grabiec in- troduced a notion of completeness for fuzzy metric spaces (in the sense of Kramosil and Michalek) that successfully used to obtain a fuzzy version of Ba- nachs contraction principle. According to the classical case, one can expect that a compact fuzzy metric space be complete in Grabiecs sense. We show here that this is not the case,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012